Parameterized Coloring Problems on Chordal Graphs
نویسنده
چکیده
In the precoloring extension problem (PrExt) a graph is given with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to a proper coloring of the graph with the given number of colors. Two parameterized versions of the problem are studied in the paper: either the number of precolored vertices or the number of colors used in the precoloring is restricted to be at most k. We show that these problems are polynomial time solvable but W[1]hard in chordal graphs. For a graph class F , let F + ke (resp. F + kv) denote those graphs that can be made to be a member of F by deleting at most k edges (resp. vertices). We investigate the connection between PrExt in F and the coloring of F + ke, F + ve graphs. Answering an open question of Leizhen Cai [5], we show that coloring chordal+ke graphs is fixed-parameter tractable.
منابع مشابه
Algorithmic Aspects of Dominator Colorings in Graphs
In this paper we initiate a systematic study of a problem that has the flavor of two classical problems, namely Coloring and Domination, from the perspective of algorithms and complexity. A dominator coloring of a graph G is an assignment of colors to the vertices of G such that it is a proper coloring and every vertex dominates all the vertices of at least one color class. The minimum number o...
متن کاملApproximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs
We consider the problem of aligned coloring of interval and chordal graphs. These problems have substantial applications to register allocation in compilers and have recently been proven NP-Hard. We provide the first constant approximations: a 4 3 -approximation for interval graphs and a 3 2 -approximation for chordal graphs. We extend our techniques to the problem of minimizing spillage in the...
متن کاملTractability of parameterized completion problems on chordal and interval graphs: Minimum Fill-in and Physical Mapping
We study the parameterized complexity of several NP-Hard graph completion problems: The MINIMUM FILL-IN problem is to decide if a graph can be triangulated by adding at most k edges. We develop an O(k 5 mn + f(k)) algorithm for the problem on a graph with n vertices and m edges. In particular, this implies that the problem is xed parameter tractable (FPT). PROPER INTERVAL GRAPH COMPLETION probl...
متن کاملNP-completeness results for some problems on subclasses of bipartite and chordal graphs
Extending previous NP-completeness results for the harmonious coloring problem and the pair-complete coloring problem on trees, bipartite graphs and cographs, we prove that these problems are also NP-complete on connected bipartite permutation graphs. We also study the k-path partition problem and, motivated by a recent work of Steiner [G. Steiner, On the k-path partition of graphs, Theoret. Co...
متن کاملSubexponential parameterized algorithm for minimum fill-in
The Minimum Fill-in problem is to decide if a graph can be triangulated by adding at most k edges. Kaplan, Shamir, and Tarjan [FOCS 1994] have shown that the problem is solvable in time O(2O(k) + knm) on graphs with n vertices and m edges and thus is fixed parameter tractable. Here, we give the first subexponential parameterized algorithm solving Minimum Fillin in time O(2O( √ k log k) + knm). ...
متن کامل